On a ternary coalescent process
نویسنده
چکیده
We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a second construction of the coalescent in terms of random binary forests and study asymptotic properties. Starting from N particles of unit mass, we obtain under an appropriate rescaling when N tends to infinity a well-known binary coalescent, the so-called standard additive coalescent.
منابع مشابه
A Construction of a β-Coalescent via the Pruning of Binary Trees
Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a β( 3 2 , 1 2 )-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuum random tree, to construct a continuous state space process that has the same structure as the β-coalescent process up to some time chang...
متن کاملColored Genealogical Trees and Coalescent Theory
We introduce a colored coalescent process which recovers random colored genealogical trees. Here a colored genealogical tree has its vertices colored black or white. Moving backward along the colored genealogical tree, the color of vertices may change only when two vertice coalesce. The rule that governs the change of color involves a parameter x. When x = 1/2, the colored coalescent process ca...
متن کاملThe mutation process in colored coalescent theory.
The mutation process is introduced into the colored coalescent theory. The mutation process can be viewed as an independent Poisson process running on the colored genealogical random tree generated by the colored coalescent process, with the edge lengths of the random tree serving as the time scale for the mutation process. Moving backward along the colored genealogical tree, the color of verti...
متن کاملBeta-coalescents in continuum Lévy trees
Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a Beta(3/2, 1/2)coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuumrandom tree, to construct a continuous state space process that has the same structure as the beta-coalescent process up to some time chan...
متن کاملLie ternary $(sigma,tau,xi)$--derivations on Banach ternary algebras
Let $A$ be a Banach ternary algebra over a scalar field $Bbb R$ or $Bbb C$ and $X$ be a ternary Banach $A$--module. Let $sigma,tau$ and $xi$ be linear mappings on $A$, a linear mapping $D:(A,[~]_A)to (X,[~]_X)$ is called a Lie ternary $(sigma,tau,xi)$--derivation, if $$D([a,b,c])=[[D(a)bc]_X]_{(sigma,tau,xi)}-[[D(c)ba]_X]_{(sigma,tau,xi)}$$ for all $a,b,cin A$, where $[abc]_{(sigma,tau,xi)}=ata...
متن کامل